#include "BSTree.h"


int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree <int> bst;
	for ( auto& v : a)
	{
		bst.Insert(v);
	}
	bst.Inorder();
	bst.erase(8);
	cout << endl;
	bst.Inorder();

	return 0;
}